Rudimentary Kripke Models for the Intuitionistic Propositional Calculus

نویسنده

  • Kosta Dosen
چکیده

DoSen, K., Rudimentary Kripe models for the intuitionistic propositional calculus, Annals of Pure and Applied Logic 62 (1993) 21-49. It is shown that the intuitionistic propositional calculus is sound and complete with respect to Kripke-style models that are not quasi-ordered. These models, called rudimentary Kripke models, differ from the ordinary intuitionistic Kripke models by making fewer assumptions about the underlying frames, but have the same conditions for valuations. However, since accessibility between points in the frames need not be reflexive, we have to assume, besides the usual intuitionistic heredity, the converse of heredity, which says that if a formula holds in all points accessible to a point X, then it holds in X. Among frames of rudimentary Kripke models, particular attention is paid to those that guarantee that the assumption of heredity and converse heredity for propositional variables implies heredity and converse heredity for all propositional formulae. These frames need to be neither reflexive nor transitive. The intuitionistic propositional calculus, which we call H (after Heyting), is sound and complete with respect to Kripke models based on quasi-ordered frames. Besides this class of Kripke models there are many smaller classes of Kripke models with respect to which H is sound and complete. For example, we may require from the frames of Kripke models that in addition to being quasi-ordered they satisfy one or more of the following: the frame is partially ordered (i.e., we have added antisymmetry), the frame is generated (i.e., there is a point which is lesser than or equal to every point), the frame is a tree, the frame is a Jaskowski tree, the frame is finite. 0168-0072/93/$06.00

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rudimentary Beth Models and Conditionally Rudimentary Kripke Models for the Heyting Propositional Calculus

This paper continues the investigation of rudimentary Kripke models, i.e. non-quasiordered Kripke-style models for the Heyting propositional calculus H. Three topics, which make three companion pieces of [3], are pursued. The first topic is Beth-style models for H called rudimentary Beth models. Rudimentary Kripke models may be conceived as a particular type of these models, which are analogous...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

On Sequent Calculi for Intuitionistic Propositional Logic

The well-known Dyckoff’s 1992 calculus/procedure for intuitionistic propositional logic is considered and analyzed. It is shown that the calculus is Kripke complete and the procedure in fact works in polynomial space. Then a multi-conclusion intuitionistic calculus is introduced, obtained by adding one new rule to known calculi. A simple proof of Kripke completeness and polynomial-space decidab...

متن کامل

A Simplification Rules for Intuitionistic Propositional Tableaux

The implementation of a logic requires, besides the definition of a calculus and a decision procedure, the development of techniques to reduce the search space. In this paper we introduce some simplification rules for Intuitionistic propositional logic that try to replace a formula with an equi-satisfiable “simpler” one with the aim to reduce the search space. Our results are proved via semanti...

متن کامل

Explorations and computations in bidirectional intuitionistic propositional logic

This paper investigates the semantics of the intuitionistic propositional logic (IPL) extended with subtraction, also known as the HeytingBrouwer logic or biIPL. It introduces and extends some basic concepts and theorems in the Kripke semantics of intuitionistic propositional logic to obtain new results on the exact models of fragments in the bidirectional case. The paper also includes results ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 62  شماره 

صفحات  -

تاریخ انتشار 1993